A special Tree based index structure
نویسندگان
چکیده
Volume 6, Issue 5, September – October 2017 Page 98 Abstract: Cloud computing yields a variety of advantages like high storage space, shared resources and less management etc. Searchable encryption schemes are implemented to store the encrypted data. But this approach suffers from lack of security. To overcome this problem, a new tree based structure having Greedy Depth First Search algorithm is implemented to perform search process. Vector space and term frequency in addition to inverse document frequency are the two mechanisms responsible for efficient index and query generation. This approach involves UDMRS schemes which are more secure and efficient and it performs various operations like insertion and deletion of documents.
منابع مشابه
The GC-tree: a high-dimensional index structure for similarity search in image databases
With the proliferation of multimedia data, there is an increasing need to support the indexing and retrieval of high-dimensional image data. In this paper, we propose a new dynamic index structure called the GC-tree (or the grid cell tree) for efficient similarity search in image databases. The GC-tree is based on a special subspace partitioning strategy which is optimized for a clustered high-...
متن کاملDistributed AH-Tree Based Index Technology for Multi-channel Wireless Data Broadcast
Alphabetic Huffman Tree (AH-Tree) is an appropriate data structure to index data set with skewed access frequencies, which fits the feature of web-based wireless data broadcast service to a mass number of mobile clients. In this paper we solve a long-time open question to construct an arbitrary k-ary AH-Tree with Hu-Tucker algorithm [1] by dynamic programming, whose time complexity is O(kn), wh...
متن کاملrhoIndex – Designing and Evaluating an Indexing Structure for Graph Structured Data
An own design of an indexing structure for general graph structured data called -index that allows an effective processing of special path queries is presented. These special queries represent for example a search for all paths lying between two arbitrary vertices limited to a certain path length. The -index is a multilevel balanced tree structure where each node is created with a certain graph...
متن کاملThe Structure of Plant Population of Forested Rangeland in Different Legal Definitions (Case Study: Sabzkouh Region, Chaharmahal & Bakhtiari Province, Iran)
There is less published research on ecosystems of forested rangeland in Iran. This research was conducted to investigate the forested rangeland area based on legal definition via comparison of indices species richness, diversity, and morphology of the trees and shrubs in Sabzkouh watershed, Chaharmahal Bakhtiari province, Iran. Quantitative characteristics of trees and shrubs were measured by 5...
متن کاملBob-Tree: An Efficient B + -Tree Based Index Structure for Geographic-Aware Obfuscation
The privacy protection of personal location information increasingly gains special attention in the field of location-based services, and obfuscation is the most popular technique aiming at protecting this sensitive information. However, all of the conventional obfuscation techniques are geometry-based and separated from the database level. Thus, the query processing has two timeconsuming phase...
متن کاملT-Tree or B-Tree: Main Memory Database Index Structure Revisited
* The second author's work is partially supported by a grant from the Research Grant Council of Hong Kong Special Administrative Region, China (No. HKUST758/96E ). The third author's work is partially supported by a grant from Sino Software Research Institute (No. SSRI97/98.EG02). 1 On leave from the School of Computing, The National University of Singapore. 2 Currently a visiting scholar at th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017